Double Round Auctions

ثبت نشده
چکیده

This article analyzes auctions that can feature two bidding rounds for the sale of a single good. In the first round the seller, after analyzing the received bids, may elect to have k bidders rebid. The highest bidder in the second round receives the asset at the highest bid price. We use a sample of 67 properties that sold through this auction process. The 40 hotels in this sample are matched to a control group of 165 hotel properties that were sold in the conventional manner in order to develop a hedonic model for sale prices. From this model, we find that the double round auction mechanism increases the seller’s revenue significantly: specifically, we estimate that the expected value of a double round auction sale (in either round) is 15.4% larger than if the property were sold using traditional methods. We further find (controlling for property characteristics) that the average bid increases by 3.7% from the first to the second round and that the expected value of a second round bid is 8.5% larger than the expected value of a first round bid.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms

Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...

متن کامل

Speeding Up Ascending-Bid Auctions

In recent years auctions have grown in interest within the AI community as innovative mechanisms for resource allocation. The primary contribution of this paper is to identify a family of hybrid auctions, called survival auctions, which combine the benefits of both sealed-bid auctions (namely, quick and predictable termination time) and ascendingbid auctions (namely, more information revelation...

متن کامل

A Novel Market Learning Algorithm for Grid Resource Allocation

The aim of this research has been to introduce a learning algorithm based on market concepts for grid resource allocation and resolve some incompetence with current mechanisms. Grid resource allocation could be considered as a double auction in which grid resource manager acts as an auctioneer and jobs and resource owners act as buyers (resource consumers) and sellers. In our novel algorithm re...

متن کامل

Shill Bidding In Multi-Round Online Auctions

The online implementation of traditional business mechanisms raises many new issues not considered in classical economic models. This partially explains why online auctions have become the most successful but also the most controversial Internet businesses in the recent years. One emerging issue is that the lack of authentication over the Internet has encouraged shill bidding, the deliberate pl...

متن کامل

Sequential Incremental-Value Auctions

We study the distributed allocation of tasks to cooperating robots in real time, where each task has to be assigned to exactly one robot so that the sum of the latencies of all tasks is as small as possible. We propose a new auction-like algorithm, called Sequential Incremental-Value (SIV) auction, which assigns tasks to robots in multiple rounds. The idea behind SIV auctions is to assign as ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015